622 research outputs found
Hyperdeterminants on semilattices
We compute hyperdeterminants of hypermatrices whose indices belongs in a
meet-semilattice and whose entries depend only of the greatest lower bound of
the indices. One shows that an elementary expansion of such a polynomial allows
to generalize a theorem of Lindstr\"om to higher-dimensional determinants. And
we gave as an application generalizations of some results due to Lehmer, Li and
Haukkanen.Comment: New version of "A remark about factorizing GCD-type
Hyperdeterminants". Title changed. Results, examples and remarks adde
Bell polynomials in combinatorial Hopf algebras
We introduce partial -Bell polynomials in three combinatorial Hopf
algebras. We prove a factorization formula for the generating functions which
is a consequence of the Zassenhauss formula.Comment: 7 page
Noncommutative Symmetric Functions Associated with a Code, Lazard Elimination, and Witt Vectors
The construction of the universal ring of Witt vectors is related to Lazard's
factorizations of free monoids by means of a noncommutative analogue. This is
done by associating to a code a specialization of noncommutative symmetric
functions
Clustering properties of rectangular Macdonald polynomials
The clustering properties of Jack polynomials are relevant in the theoretical
study of the fractional Hall states. In this context, some factorization
properties have been conjectured for the -deformed problem involving
Macdonald polynomials. The present paper is devoted to the proof of this
formula. To this aim we use four families of Jack/Macdonald polynomials:
symmetric homogeneous, nonsymmetric homogeneous, shifted symmetric and shifted
nonsymmetric.Comment: 43 pages, 2 figure
On the self-convolution of generalized Fibonacci numbers
We focus on a family of equalities pioneered by Zhang and generalized by Zao
and Wang and hence by Mansour which involves self convolution of generalized
Fibonacci numbers. We show that all these formulas are nicely stated in only
one equation involving a bivariate ordinary generating function and we give
also a formula for the coefficients appearing in that context. As a
consequence, we give the general forms for the equalities of Zhang, Zao-Wang
and Mansour
Math Oracles: A New Way of Designing Efficient Self-Adaptive Algorithms
In this paper we present a new general methodology to develop self-adaptive methods at a low computational cost. Instead of going purely ad-hoc we de ne several simple steps to include theoretical models as additional information in our algorithm. Our idea is to incorporate the predictive information (future behavior) provided by well-known mathematical models or other prediction systems (the oracle) to build enhanced methods. We show the main steps which should be considered to include this new kind of information into any algorithm. In addition, we actually test the idea on a speci c algorithm, a genetic algorithm (GA). Experiments show that our proposal is able to obtain similar, or even better results when it is compared to the traditional algorithm. We also show the bene ts in terms of saving time and a lower complexity of parameter settings.Universidad de Málaga. Proyecto roadME (TIN2011-28194
Singularity of type arising from four qubit systems
An intriguing correspondence between four-qubit systems and simple
singularity of type is established. We first consider an algebraic
variety of separable states within the projective Hilbert space
. Then, cutting with a specific
hyperplane , we prove that the -hypersurface, defined from the section
, has an isolated singularity of type ; it is also shown
that this is the "worst-possible" isolated singularity one can obtain by this
construction. Moreover, it is demonstrated that this correspondence admits a
dual version by proving that the equation of the dual variety of , which is
nothing but the Cayley hyperdeterminant of type ,
can be expressed in terms of the SLOCC invariant polynomials as the
discriminant of the miniversal deformation of the -singularity.Comment: 20 pages, 5 table
Some Combinatorial Operators in Language Theory
Multitildes are regular operators that were introduced by Caron et al. in
order to increase the number of Glushkov automata. In this paper, we study the
family of the multitilde operators from an algebraic point of view using the
notion of operad. This leads to a combinatorial description of already known
results as well as new results on compositions, actions and enumerations.Comment: 21 page
- …